import java.util.Arrays;
import java.util.Random;

public class Test {

    public static void testInsertSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.insertSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("插入排序耗费时间："+(endTime - startTime));
    }

    public static void testShellSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.shellSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("希尔排序耗费时间："+(endTime - startTime));
    }

    public static void testSelectSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.selectSort1(array);
        long endTime = System.currentTimeMillis();
        System.out.println("选择排序耗费时间："+(endTime - startTime));
    }

    public static void testHeapSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.heapSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("堆排序耗费时间："+(endTime - startTime));
    }


    public static void testBubbleSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.bubbleSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("冒泡排序耗费时间："+(endTime - startTime));
    }

    public static void testQuickSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.quickSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("快速排序耗费时间："+(endTime - startTime));
    }

    public static void testMergeSort(int[] array) {
        array = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.mergeSort(array);
        long endTime = System.currentTimeMillis();
        System.out.println("归并排序耗费时间："+(endTime - startTime));
    }

    public static void orderArray(int[] array) {
        for(int i = 0; i < array.length; i++) {
            //array[i] = i;
            array[i] = array.length - i;
        }
    }


    public static void notOrderArray(int[] array) {
        Random random = new Random();
        for(int i = 0; i < array.length; i++) {
            array[i] = random.nextInt(100000);
        }
    }

    public static void main(String[] args) {
        int[] array = new int[100000];
        //orderArray(array);
        notOrderArray(array);
        testInsertSort(array);
        //testShellSort(array);
        //testSelectSort(array);
        testHeapSort(array);
        //testBubbleSort(array);
        testQuickSort(array);
        testMergeSort(array);
    }
}
